Probabilistic Time Petri Nets
نویسندگان
چکیده
We introduce a new model for the design of concurrent stochastic real-time systems. Probabilistic time Petri nets (PTPN) are an extension of time Petri nets in which the output of tokens is randomised. Such a design allows us to elegantly solve the hard problem of combining probabilities and concurrency. This model further benefits from the concision and expressive power of Petri nets. Furthermore, the usual tools for the analysis of time Petri nets can easily be adapted to our probabilistic setting. More precisely, we show how a Markov decision process (MDP) can be derived from the classic atomic state class graph construction. We then establish that the schedulers of the PTPN and the adversaries of the MDP induce the same Markov chains. As a result, this construction notably preserves the lower and upper bounds on the probability of reaching a given target marking. We also prove that the simpler original state class graph construction cannot be adapted in a similar manner for this purpose.
منابع مشابه
Hybrid Time Delay Petri Nets as a Mathematical Novel Tool to Model Dynamic System with Current Sample Time
The existing modeling methods using Petri Nets, have been successfully applied to model and analyze dynamic systems. However, these methods are not capable of modeling all dynamic systems such as systems with the current sample time signals, systems including various subsystems and multi-mode systems. This paper proposes Hybrid Time Delay Petri Nets (HTDPN) to solve the problem. In ...
متن کاملPetri Nets and Dependability
Dependability evaluation main objective is to assess the ability of a system to correctly function over time. There are many possible approaches to the evaluation of dependability: in these notes we are mainly concerned with dependability evaluation based on probabilistic models. Starting from simple probabilistic models with very efficient solution methods we shall then come to the main topic ...
متن کاملTime Management Approach on a Discrete Event Manufacturing System Modeled by Petri Net
Discrete event system, Supervisory control, Petri Net, Constraint This paper presents a method to manage the time in a manufacturing system for obtaining an optimized model. The system in this paper is modeled by the timed Petri net and the optimization is performed based on the structural properties of Petri nets. In a system there are some states which are called forbidden states an...
متن کاملTrue-concurrency Probabilistic Models: Markov Nets and a Law of Large Numbers Samy Abbes and Albert Benveniste
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics. This model builds upon our previous work on probabilistic event structures. We use the notion of branching cell for event structures and show that the latter provides the adequate notion of local state, for nets. We prove a Law of Large Numbers (LLN) for Markov nets—this con...
متن کاملPerformance Evaluation Using Timed Coloured Petri Nets
Coloured Petri nets are Petri nets in which attributes are associated with individual tokens. These attributes are called “colours”. The set of colours is finite. Colors can be modified during transition firings, and the same transition can perform diffcrcn t transformations for tokens of different colours. Colours can thus distinguish tokens, and this allows to “fold” similar subnets of a net ...
متن کامل